Simultaneous Batching and Scheduling Using Dynamic Decomposition on a Grid
نویسندگان
چکیده
منابع مشابه
Simultaneous Batching and Scheduling Using Dynamic Decomposition on a Grid
Scheduling problems arise in many applications in process industries. However, despite various efforts to develop efficient scheduling methods, current approaches cannot be used to solve instances of industrial importance in reasonable time frames. The goal of this paper is the development of a dynamic decomposition scheme that exploits the structure of the problem and is well suited for grid c...
متن کاملSimultaneous Batching and Scheduling of Single Stage Batch Plants
This paper presents a new mixed integer linear program (MILP) for the optimal short-term scheduling of single stage batch plants with sequence dependent changeovers and optimal selection of the number of batches to produce. It is a continuous-time formulation employing multiple time grids that is based on the resource-task network (RTN) process representation. The main novelty is that aggregate...
متن کاملScheduling a Batching Machine
We address the problem of scheduling n jobs on a batching machine to minimize regular scheduling criteria that are non-decreasing in the job completion times. A batching machine is a machine that can handle up to b jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is equal to the la...
متن کاملUsing Grid Benchmarks for Dynamic Scheduling of Grid Applications
Navigation or dynamic scheduling of applications on computational grids can be improved through the use of an application-specijic characterization of grid resources. Current grid information systems provide a description of the resources, but do not contain any application-speciJc information. We defne a “GridScape ’’ as dynamic state of the grid resources. We measure the dynamic performance o...
متن کاملA Stochastic Batching and Scheduling Problem
We consider a batch scheduling problem in which the processing time of a batch of jobs equals the maximum of the processing times of all jobs in the batch. This is the case, for example, for burn-in operations in semiconductor manufacturing, and other testing operations. Processing times are assumed to be random, and we consider minimizing the makespan and the flowtime. The problem is much more...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2009
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.1090.0339